Graph Invariants and Graph Isomorphism
نویسندگان
چکیده
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, information retrieval, social networks, etc. Graph Invariants are used to determine the isomorphism between two graphs. Graph Invariant is only the necessary condition for graph Isomorphism. Most of the researchers believe that isomorphism problem is NP complete problem and the most difficult problem .Graph isomorphism is a NP complete or not is always a hot issue for the researchers to study. In this paper we discuss the graph invariants and graph isomorphism techniques. KeywordsGraph Isomorphism, Subgraph Isomorphism, and Graph Invariant
منابع مشابه
Applications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملAlgebraic Combinatorics in Mathematical Chemistry
This paper deals with graph invariants and stabilization procedures. We consider colored graphs and their automorphisms and we discuss the isomorphism problem for such graphs. Various global and local isomorphism invariants are introduced. We study canonical numberings, invariant partitions, stable and equitable partitions and algorithms for stabilizing partitions.
متن کاملNew Invariants for the Graph Isomorphism Problem
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other wellknown methods could not compute (such as special Fürer Gadgets and point-line incidence graphs of finite projective planes of higher d...
متن کامل